Preferences of agents in decentralized task allocation
نویسندگان
چکیده
منابع مشابه
Preferences of agents in decentralized task allocation
The ability to express preferences for specific tasks in multiagent auctions is an important element for potential users who are considering to use such auctioning systems. This paper presents an approach to make such preferences explicit and to use these preferences in bids for reverse combinatorial auctions. Three different types of preference are considered: (1) preferences for particular du...
متن کاملAgents Preferences in Decentralized Task Allocation
The ability to express preferences for specific tasks in multi-agent auctions is an important element for potential users who are considering to use such auctioning systems. This paper presents an approach to make such preferences explicit and to use these preferences in bids for reverse combinatorial auctions. Three different types of preference are considered: (1) preferences for particular d...
متن کاملAsynchronous Decentralized Task Allocation for Dynamic Environments
This work builds on a decentralized task allocation algorithm for networked agents communicating through an asynchronous channel. The algorithm extends the Asynchronous Consensus-Based Bundle Algorithm (ACBBA) to account for more real time implementation issues resulting from a decentralized planner. This work utilizes a new implementation that allows further insight into the consensus and mess...
متن کاملDecentralized Task Allocation for Dynamic Environments
This thesis presents an overview of the design process for creating greedy decentralized task allocation algorithms and outlines the main decisions that progressed the algorithm through three different forms. The first form was called the Sequential Greedy Algorithm (SGA). This algorithm, although fast, relied on a large number of iterations to converge, which slowed convergence in decentralize...
متن کاملA Market Protocol for Decentralized Task Allocation
We present a decentralized market protocol for allocating tasks among agents that contend for scarce resources. Agents trade tasks and resources at prices determined by an auction protocol. We specify a simple set of bidding policies that, along with the auction mechanism, exhibits desirable convergence properties. The system always reaches quiescence. If the system reaches quiescence below the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AI Communications
سال: 2009
ISSN: 0921-7126
DOI: 10.3233/aic-2009-0451